A generalized Ramsey problem
نویسندگان
چکیده
منابع مشابه
An Extremal Problem in Generalized Ramsey Theory
A connected graph G of order n is called m-good if r(Km ,G) = (m-1)(n-1) + 1 . Let f(m,n) be the largest integer q such that every connected graph of order n and size q is m-good and let g(m,n) be the largest q for which there exists a connected graph G of order n and size q which is m-good . Asymptotic bounds are given for f and g . 1 . Tntroduction . One of the most notable yet simply proved ...
متن کاملAn explicit construction for a generalized Ramsey problem
An explicit coloring of the edges of Kn is constructed such that every copy of K4 has at least four colors on its edges. As n →∞, the number of colors used is n. This improves upon the previous bound of O(n) due to Erdős and Gyárfás obtained by probabilistic methods. The exponent 1/2 is optimal, since it is known that at least Ω(n) colors are required in such a coloring. The coloring is related...
متن کاملThe Erdős–Gyárfás problem on generalized Ramsey numbers
Fix positive integers p and q with 2 q ( p 2 ) . An edge coloring of the complete graph Kn is said to be a (p, q)-coloring if every Kp receives at least q different colors. The function f(n, p, q) is the minimum number of colors that are needed for Kn to have a (p, q)-coloring. This function was introduced about 40 years ago, but Erdős and Gyárfás were the first to study the function in a syste...
متن کاملOn generalized Ramsey numbers
Let f1 and f2 be graph parameters. The Ramsey number r(f1 ≥ m; f2 ≥ n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) ≥ m or f2(G) ≥ n. A general existence condition is given and a general upper bound is shown in this paper. In addition, suppose the number of triangles in G is denoted by t(G). We verify that (1− o(1))(24n) ≤ r(t ≥ n; t ≥ n) ≤ (1 + o(1))(48...
متن کاملOn a Quasi-Ramsey problem
It is proved that if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with at least n vertices and minimum degree at least I V(H) I /2. This result is not far from being best possible, as is shown by a rather unusual random construction . Some related questions are also discussed .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00052-2